-
1 dynamic monoid
Большой англо-русский и русско-английский словарь > dynamic monoid
-
2 dynamic monoid
Математика: динамический моноид -
3 dynamic monoid
мат. -
4 monoid
1) полугруппа
2) моноид
3) имеющая N-1-кратную точку линия N-го порядка ∙ countably generated monoid ≈ счетно порожденный моноид finitely generated monoid ≈ конечно порожденный моноид monoid with identity ≈ полугруппа с единицей - abstract monoid - augemented monoid - augmented monoid - bicyclic monoid - commutative monoid - compactible monoid - covered monoid - dynamic monoid - finite monoid - free monoid - fuzzy monoid - lattice-ordered monoid - monoid algebra - monoid complex - monoid homomorphism - monoid image - monoid of automaton - multiplicative monoid - noncompactible monoid - partial monoid - quasicompactible monoid - quotient monoid - topological monoid - torsionless monoid - uniform monoid (математика) моноид, полугруппа monoid моноид -
5 monoid
1) геом. имеющая N-1-кратную точку линия N-го порядка2) мат. моноид, полугруппа• -
6 динамический моноид
Большой англо-русский и русско-английский словарь > динамический моноид
См. также в других словарях:
Semiring — In abstract algebra, a semiring is an algebraic structure similar to a ring, but without the requirement that each element must have an additive inverse. The term rig is also used occasionally this originated as a joke, suggesting that rigs are… … Wikipedia
Ordinal optimization — In mathematical optimization, ordinal optimization is the maximization of functions taking values in a partially ordered set ( poset ). Ordinal optimization has applications in the theory of queuing networks. Contents 1 Mathematical foundations 1 … Wikipedia
String (computer science) — In formal languages, which are used in mathematical logic and theoretical computer science, a string is a finite sequence of symbols that are chosen from a set or alphabet. In computer programming, a string is traditionally a sequence of… … Wikipedia
Joy (programming language) — Joy Paradigm(s) multi paradigm: functional, concatenative, stack oriented Appeared in 2001 Designed by Manfred von Thun Developer Manfred von Thun, John Cowan St … Wikipedia
Longest increasing subsequence — The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not… … Wikipedia
Huffman coding — Huffman tree generated from the exact frequencies of the text this is an example of a huffman tree . The frequencies and codes of each character are below. Encoding the sentence with this code requires 135 bits, as opposed of 288 bits if 36… … Wikipedia
Quantum harmonic oscillator — The quantum harmonic oscillator is the quantum mechanical analogue of the classical harmonic oscillator. It is one of the most important model systems in quantum mechanics because an arbitrary potential can be approximated as a harmonic potential … Wikipedia
Concatenative programming language — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurr … Wikipedia
